Non-linear anonymous pricing combinatorial auctions
نویسندگان
چکیده
منابع مشابه
Pricing combinatorial auctions
Single-item auctions have many desirable properties. Mechanisms exist to ensure optimality, incentive compatibility and market-clearing prices. When multiple items are offered through individual auctions, a bidder wanting a bundle of items faces an exposure problem if the bidder places a high value on a combination of goods but a low value on strict subsets of the desired collection. To remedy ...
متن کاملCoalition-Based Pricing in Ascending Combinatorial Auctions
Bidders in larger ascending combinatorial auctions face a substantial coordination problem, which has received little attention in the literature. The coordination problem manifests itself by the fact that losing bidders need to submit non-overlapping package bids which are high enough to outbid the standing winners. We propose an auction format, which leverages the information that the auction...
متن کاملOn the robustness of non-linear personalized price combinatorial auctions
Though the VCG auction assumes a central place in the mechanism design literature, there are a number of reasons for favoring iterative combinatorial auctions (ICAs). Several promising ICA formats were developed based on primal-dual and subgradient algorithms. Prices are interpreted as a feasible dual solution and the provisional allocation is interpreted as a feasible primal solution. iBundle(...
متن کاملModelling Combinatorial Auctions in Linear Logic
We show that linear logic can serve as an expressive framework in which to model a rich variety of combinatorial auction mechanisms. Due to its resource-sensitive nature, linear logic can easily represent bids in combinatorial auctions in which goods may be sold in multiple units, and we show how it naturally generalises several bidding languages familiar from the literature. Moreover, the winn...
متن کاملItem Pricing for Revenue Maximization in Combinatorial Auctions
In this talk we present item pricing algorithms and mechanisms for revenue maximization in combinatorial auctions. We start by considering the unlimitedsupply combinatorial auction setting and present a simple algorithm [1] which achieves an O(k) approximation for the case of single-minded bidders who each want at most k items, improving on the O(k2) bound of Briest and Krysta [3]. We then show...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2009
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2008.11.029